
/*
Description:
Given a string S and a string T, count the number of distinct subsequences of S which equals T.

A subsequence of a string is a new string which is formed from the original string by 
deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. 
(ie, "ACE" is a subsequence of "ABCDE" while "AEC" is not).
*/

#include <iostream>
#include <string>
#include <vector>
using namespace std;

class Solution {
public:
	int numDistinct(string s, string t) {
		int num = 0;
		return num;
	}
};

int _numDistinct()
{
	string S = "rabbbit";
	string T = "rabbit";
	//S = "babgbag", T = "bag"
	Solution solu;
	int count;

	count = solu.numDistinct(S, T);

	cout << "S:" << S << endl;
	cout << "T:" << T << endl;
	return 0;
}